منابع مشابه
Computation without Representation
The received view is that computational states are individuated at least in part by their semantic properties. I offer an alternative, according to which computational states are individuated by their functional properties. Functional properties are specified by a mechanistic explanation without appealing to any semantic properties. The primary purpose of this paper is to formulate the alternat...
متن کاملSecure Computation without Agreement
It has recently been shown that executions of authenticated Byzantine Agreement protocols in which more than a third of the parties are corrupted, cannot be composed concurrently, in parallel, or even sequentially (where the latter is true for deterministic protocols). This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place. In...
متن کاملComputational Problems without Computation
Problemen uit de discrete wiskunde lijken op het eerste gezicht vaak erg simpel. Ze kunnen meestal gemakkelijk en zonder gebruik te maken van wiskundige begrippen worden geformuleerd. Toch komt het vaak voor dat zo’n ogenschijnlijk eenvoudig probleem nog open is of dat er, zoals bij het handelsreizigersprobleem, wel een oplossing gegeven kan worden, maar alleen een die onbruikbaar is omdat de r...
متن کاملComputation without Interaction
A universal quantum computer can be constructed using non-interacting fermions. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-fermion operations such as hopping from site to site on a lattice suffice to perform all quantum logic operations. No two-particle interactions are required. A wide variety of methods can be used to constr...
متن کاملcient Representation and Computation ofTableaux
The current rst-order automatic prover FAUST, embedded in HOL, is based on a sequent calculus which is quite slow and memory intensive. In this paper, an improved version of FAUST using a modiied form of tableau calculus called Tableau Graph Calculus is presented which overcomes the well-known ineeciencies of the traditional tableau calculus to a large extent. This calculus works on a compact r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Studies
سال: 2006
ISSN: 0031-8116,1573-0883
DOI: 10.1007/s11098-005-5385-4